Search results for "Discrete Mathematics and Combinatorics"
showing 10 items of 230 documents
Two-dimensional Banach spaces with polynomial numerical index zero
2009
We study two-dimensional Banach spaces with polynomial numerical indices equal to zero.
Variational Approximations for Generalized Linear Latent Variable Models
2017
Generalized linear latent variable models (GLLVMs) are a powerful class of models for understanding the relationships among multiple, correlated responses. Estimation, however, presents a major challenge, as the marginal likelihood does not possess a closed form for nonnormal responses. We propose a variational approximation (VA) method for estimating GLLVMs. For the common cases of binary, ordinal, and overdispersed count data, we derive fully closed-form approximations to the marginal log-likelihood function in each case. Compared to other methods such as the expectation-maximization algorithm, estimation using VA is fast and straightforward to implement. Predictions of the latent variabl…
Gray code for derangements
2004
AbstractWe give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.
Variable neighborhood descent for the incremental graph drawing
2017
Abstract Graphs are used to represent reality in several areas of knowledge. Drawings of graphs have many applications, from project scheduling to software diagrams. The main quality desired for drawings of graphs is readability, and crossing reduction is a fundamental aesthetic criterion for a good representation of a graph. In this paper we target the edge crossing reduction in the context of incremental graph drawing, in which we want to preserve the layout of a graph over successive drawings. We propose a hybrid method based on the GRASP (Greedy Randomized Adaptive Search Procedure) and VND (Variable Neighborhood Descent) methodologies and compare it with previous methods via simulation.
New Approach of Controlling Cardiac Alternans
2018
The alternans of the cardiac action potential duration is a pathological rhythm. It is considered to be relating to the onset of ventricular fibrillation and sudden cardiac death. It is well known that, the predictive control is among the control methods that use the chaos to stabilize the unstable fixed point. Firstly, we show that alternans (or period-2 orbit) can be suppressed temporally by the predictive control of the periodic state of the system. Secondly, we determine an estimation of the size of a restricted attraction's basin of the unstable equilibrium point representing the unstable regular rhythm stabilized by the control. This result allows the application of predictive control…
Two-Stage Bayesian Approach for GWAS With Known Genealogy
2019
Genome-wide association studies (GWAS) aim to assess relationships between single nucleotide polymorphisms (SNPs) and diseases. They are one of the most popular problems in genetics, and have some peculiarities given the large number of SNPs compared to the number of subjects in the study. Individuals might not be independent, especially in animal breeding studies or genetic diseases in isolated populations with highly inbred individuals. We propose a family-based GWAS model in a two-stage approach comprising a dimension reduction and a subsequent model selection. The first stage, in which the genetic relatedness between the subjects is taken into account, selects the promising SNPs. The se…
Natural visibility graphs for diagnosing attention deficit hyperactivity disorder (ADHD)
2016
“NOTICE: this is the author’s version of a work that was accepted for publication in Electronic Notes in Discrete Mathematics. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Electronic Notes in Discrete Mathematics, [Volume 54, October 2016, Pages 337-342] DOI 10.1016/j.endm.2016.09.058 ¨
Packing colorings of subcubic outerplanar graphs
2018
Given a graph $G$ and a nondecreasing sequence $S=(s_1,\ldots,s_k)$ of positive integers, the mapping $c:V(G)\longrightarrow \{1,\ldots,k\}$ is called an $S$-packing coloring of $G$ if for any two distinct vertices $x$ and $y$ in $c^{-1}(i)$, the distance between $x$ and $y$ is greater than $s_i$. The smallest integer $k$ such that there exists a $(1,2,\ldots,k)$-packing coloring of a graph $G$ is called the packing chromatic number of $G$, denoted $\chi_{\rho}(G)$. The question of boundedness of the packing chromatic number in the class of subcubic (planar) graphs was investigated in several earlier papers; recently it was established that the invariant is unbounded in the class of all sub…
A note on higher order Melnikov functions
2005
We present several classes of planar polynomial Hamilton systems and their polynomial perturbations leading to vanishing of the first Melnikov integral. We discuss the form of higher order Melnikov integrals. In particular, we present new examples where the second order Melnikov integral is not an Abelian integral.
Automorphisms of hyperelliptic GAG-codes
2009
Abstract We determine the n –automorphism group of generalized algebraic-geometry codes associated with rational, elliptic and hyperelliptic function fields. Such group is, up to isomorphism, a subgroup of the automorphism group of the underlying function field.